Global convergence property of modified Levenberg-Marquardt methods for nonsmooth equations

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Modified Levenberg-Marquardt Method for Nonsmooth Equations with Finitely Many Maximum Functions

For solving nonsmooth systems of equations, the Levenberg-Marquardt method and its variants are of particular importance because of their locally fast convergent rates. Finitely manymaximum functions systems are very useful in the study of nonlinear complementarity problems, variational inequality problems, Karush-Kuhn-Tucker systems of nonlinear programming problems, and many problems in mecha...

متن کامل

Local convergence of Levenberg–Marquardt methods under Hölder metric subregularity

We describe and analyse Levenberg–Marquardt methods for solving systems of nonlinear equations. More specifically, we first propose an adaptive formula for the Levenberg–Marquardt parameter and analyse the local convergence of the method under Hölder metric subregularity. We then introduce a bounded version of the Levenberg–Marquardt parameter and analyse the local convergence of the modified m...

متن کامل

Levenberg-marquardt Methods for Constrained Nonlinear Equations with Strong Local Convergence Properties

We consider the problem of finding a solution of a constrained (and not necessarily square) system of equations, i.e., we consider systems of nonlinear equations and want to find a solution that belongs to a certain feasible set. To this end, we present two Levenberg-Marquardt-type algorithms that differ in the way they compute their search directions. The first method solves a strictly convex ...

متن کامل

Global Complexity Bound Analysis of the Levenberg-Marquardt Method for Nonsmooth Equations and Its Application to the Nonlinear Complementarity Problem

We investigate a global complexity bound of the Levenberg-Marquardt Method (LMM) for nonsmooth equations F (x) = 0. The global complexity bound is an upper bound to the number of iterations required to get an approximate solution such that ∥∇f(x)∥ ≤ ε, where f is a least square merit function and ε is a given positive constant. We show that the bound of the LMM is O(ε−2). We also show that it i...

متن کامل

A Parameter-self-adjusting Levenberg-marquardt Method for Solving Nonsmooth Equations

A parameter-self-adjusting Levenberg-Marquardt method (PSA-LMM) is proposed for solving a nonlinear system of equations F (x) = 0, where F : R → R is a semismooth mapping. At each iteration, the LM parameter μk is automatically adjusted based on the ratio between actual reduction and predicted reduction. The global convergence of PSALMM for solving semismooth equations is demonstrated. Under th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applications of Mathematics

سال: 2011

ISSN: 0862-7940,1572-9109

DOI: 10.1007/s10492-011-0027-y